Tensor-Structured Factorized Calculation of Two-Electron Integrals in a General Basis

نویسندگان

  • Venera Khoromskaia
  • Boris N. Khoromskij
  • Reinhold Schneider
چکیده

In this paper, the problem of efficient grid-based computation of the two-electron integrals (TEI) in a general basis is considered. We introduce the novel multiple tensor factorizations of the TEI unfolding matrix which decrease the computational demands for the evaluation of TEI in several aspects. Using the reduced higher-order SVD the redundancy-free product-basis set is constructed that diminishes dramatically the initial number O(N2 b ) of 3D convolutions, defined over cross-products of Nb basis functions, to O(Nb) scaling. The tensor-structured numerical integration with the 3D Newton convolving kernel is performed in 1D complexity, thus enabling high resolution over fine 3D Cartesian grids. Furthermore, using the quantized approximation of long vectors ensures the logarithmic storage complexity in the grid-size. Finally, we present and analyze two approaches to compute the Cholesky decomposition of TEI matrix based on two types of precomputed factorizations. We show that further compression is possible via columnwise quantization of the Cholesky factors. Our “black-box” approach essentially relaxes limitations on the traditional Gaussian-type basis sets, giving an alternative choice of rather general low-rank basis functions represented only by their 1D samplings on a tensor grid. Numerical tests for some moderate size compact molecules demonstrate the expected asymptotic performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tensor Numerical Methods in Quantum Chemistry: from Hartree-Fock Energy to Excited States

We resume the recent successes of the grid-based tensor numerical methods and discuss their prospects in real-space electronic structure calculations. These methods, based on the low-rank representation of the multidimensional functions and integral operators, first appeared as an accurate tensor calculus for the 3D Hartree potential using 1D complexity operations, and have evolved to entirely ...

متن کامل

Tensor numerical methods in quantum chemistry: from Hartree-Fock to excitation energies.

We resume the recent successes of the grid-based tensor numerical methods and discuss their prospects in real-space electronic structure calculations. These methods, based on the low-rank representation of the multidimensional functions and integral operators, first appeared as an accurate tensor calculus for the 3D Hartree potential using 1D complexity operations, and have evolved to entirely ...

متن کامل

Black-Box Hartree-Fock Solver by Tensor Numerical Methods

The Hartree-Fock eigenvalue problem governed by the 3D integro-differential operator is the basic model in ab initio electronic structure calculations. Several years ago the idea to solve the Hartree-Fock equation by fully 3D grid based numerical approach seemed to be a fantasy, and the tensor-structured methods did not exist. In fact, these methods evolved during the work on this challenging p...

متن کامل

Efficient calculation of integrals in mixed ramp-Gaussian basis sets.

Algorithms for the efficient calculation of two-electron integrals in the newly developed mixed ramp-Gaussian basis sets are presented, alongside a Fortran90 implementation of these algorithms, RampItUp. These new basis sets have significant potential to (1) give some speed-up (estimated at up to 20% for large molecules in fully optimised code) to general-purpose Hartree-Fock (HF) and density f...

متن کامل

Møller-Plesset (MP2) Energy Correction Using Grid-based Tensor Factorization of the Two-electron Integrals

We present a tensor-structured method to calculate the Møller-Plesset (MP2) correction to the Hartree-Fock energy with reduced computational consumptions. The approach originates from the 3D grid-based low-rank factorization of the two-electron integrals performed by the purely algebraic optimization. The computational scheme benefits from fast multilinear algebra implemented on the separable r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2013